Weighted-average stochastic games with constant payoff
نویسندگان
چکیده
منابع مشابه
Stochastic Games with Parity Mean-payoff Objective
In this paper, we compute value of two-player games with perfect information equipped with the Par∧Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region.
متن کاملPerfect-Information Stochastic Mean-Payoff Parity Games
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 2 -player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 212 -player games where the objective of the Sys...
متن کاملStrategy recovery for stochastic mean payoff games
We prove that to find optimal positional strategies for stochastic mean payoff games when the value of every state of the game is known, in general, is as hard as solving such games tout court. This answers a question posed by Daniel Andersson and Peter Bro Miltersen. In this note, we consider perfect information 0-sum stochastic games, which, for short, we will just call stochastic games. For ...
متن کاملOn Canonical Forms for Two-person Zero-sum Limiting Average Payoff Stochastic Games
We consider two-person zero-sum mean payoff undiscounted stochastic games. We give a sufficient condition for the existence of a saddle point in uniformly optimal stationary strategies. Namely, we obtain sufficient conditions that enable us to bring the game, by applying potential transformations to a canonical form in which locally optimal strategies are globally optimal, and hence the value f...
متن کاملA lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games
It is shown that the discount factor needed to solve an undiscounted mean payoff stochastic game to optimality is exponentially close to 1, even in games with a single random node and polynomially bounded rewards and transition probabilities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2021
ISSN: 1109-2858,1866-1505
DOI: 10.1007/s12351-021-00625-6